0.12/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n008.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1440 0.13/0.34 % WCLimit : 180 0.13/0.34 % DateTime : Thu Jul 4 07:24:09 EDT 2024 0.13/0.34 % CPUTime : 0.20/0.49 Running higher-order theorem proving 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.3JbNtkTpd8/E---3.1_18208.p 0.20/0.51 # Version: 3.2.0-ho 0.20/0.51 # Preprocessing class: HSSSSLSSSLSNSFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting new_ho_10 with 900s (5) cores 0.20/0.51 # Starting ehoh_best_sine_rwall with 180s (1) cores 0.20/0.51 # Starting lpo1_def_fix with 180s (1) cores 0.20/0.51 # Starting ehoh_best8_lambda with 180s (1) cores 0.20/0.51 # ehoh_best_sine_rwall with pid 18295 completed with status 0 0.20/0.51 # Result found by ehoh_best_sine_rwall 0.20/0.51 # Preprocessing class: HSSSSLSSSLSNSFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting new_ho_10 with 900s (5) cores 0.20/0.51 # Starting ehoh_best_sine_rwall with 180s (1) cores 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000 0.20/0.51 # Search class: HGUSF-FFSF32-MSFFMFNN 0.20/0.51 # partial match(1): HGUSF-FFSF32-MHFFMFNN 0.20/0.51 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.20/0.51 # Starting new_ho_10 with 98s (1) cores 0.20/0.51 # new_ho_10 with pid 18298 completed with status 0 0.20/0.51 # Result found by new_ho_10 0.20/0.51 # Preprocessing class: HSSSSLSSSLSNSFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting new_ho_10 with 900s (5) cores 0.20/0.51 # Starting ehoh_best_sine_rwall with 180s (1) cores 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000 0.20/0.51 # Search class: HGUSF-FFSF32-MSFFMFNN 0.20/0.51 # partial match(1): HGUSF-FFSF32-MHFFMFNN 0.20/0.51 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.20/0.51 # Starting new_ho_10 with 98s (1) cores 0.20/0.51 # Preprocessing time : 0.001 s 0.20/0.51 # Presaturation interreduction done 0.20/0.51 0.20/0.51 # Proof found! 0.20/0.51 # SZS status Theorem 0.20/0.51 # SZS output start CNFRefutation 0.20/0.51 thf(decl_22, type, in: $i > $i > $o). 0.20/0.51 thf(decl_23, type, emptyset: $i). 0.20/0.51 thf(decl_24, type, setadjoin: $i > $i > $i). 0.20/0.51 thf(decl_25, type, setunion: $i > $i). 0.20/0.51 thf(decl_26, type, setadjoinE: $o). 0.20/0.51 thf(decl_27, type, setunionE: $o). 0.20/0.51 thf(decl_28, type, uniqinunit: $o). 0.20/0.51 thf(decl_29, type, binunion: $i > $i > $i). 0.20/0.51 thf(decl_30, type, esk1_3: $i > $i > $o > $i). 0.20/0.51 thf(decl_31, type, esk2_0: $i). 0.20/0.51 thf(decl_32, type, esk3_0: $i). 0.20/0.51 thf(decl_33, type, esk4_0: $i). 0.20/0.51 thf(decl_34, type, epred1_0: $o). 0.20/0.51 thf(binunion, axiom, ((binunion)=(^[X1:$i, X3:$i]:(setunion @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset))))), file('/export/starexec/sandbox2/tmp/tmp.3JbNtkTpd8/E---3.1_18208.p', binunion)). 0.20/0.51 thf(binunionEcases, conjecture, ((setadjoinE)=>((setunionE)=>((uniqinunit)=>![X2:$i, X5:$i, X1:$i, X4:$o]:(((((in @ X1 @ X2)=>(X4))=>(((in @ X1 @ X5)=>(X4))=>(X4)))<=(in @ X1 @ (binunion @ X2 @ X5))))))), file('/export/starexec/sandbox2/tmp/tmp.3JbNtkTpd8/E---3.1_18208.p', binunionEcases)). 0.20/0.51 thf(setadjoinE, axiom, ((setadjoinE)<=>![X1:$i, X2:$i, X3:$i]:(((in @ X3 @ (setadjoin @ X1 @ X2))=>![X4:$o]:(((((X3)=(X1))=>(X4))=>(((in @ X3 @ X2)=>(X4))=>(X4))))))), file('/export/starexec/sandbox2/tmp/tmp.3JbNtkTpd8/E---3.1_18208.p', setadjoinE)). 0.20/0.51 thf(uniqinunit, axiom, ((uniqinunit)<=>![X1:$i, X3:$i]:(((in @ X1 @ (setadjoin @ X3 @ emptyset))=>((X1)=(X3))))), file('/export/starexec/sandbox2/tmp/tmp.3JbNtkTpd8/E---3.1_18208.p', uniqinunit)). 0.20/0.51 thf(setunionE, axiom, ((setunionE)<=>![X2:$i, X1:$i]:(((in @ X1 @ (setunion @ X2))=>![X4:$o]:((![X5:$i]:(((in @ X1 @ X5)=>((in @ X5 @ X2)=>(X4))))=>(X4)))))), file('/export/starexec/sandbox2/tmp/tmp.3JbNtkTpd8/E---3.1_18208.p', setunionE)). 0.20/0.51 thf(c_0_5, plain, ((binunion)=(^[Z0/* 19 */:$i, Z1:$i]:(setunion @ (setadjoin @ Z0 @ (setadjoin @ Z1 @ emptyset))))), inference(fof_simplification,[status(thm)],[binunion])). 0.20/0.51 thf(c_0_6, negated_conjecture, ~((![X20:$i, X21:$i, X22:$i]:(((in @ X22 @ (setadjoin @ X20 @ X21))=>![X23:$o]:(((((X22)=(X20))=>(X23))=>(((in @ X22 @ X21)=>(X23))=>(X23))))))=>(![X24:$i, X25:$i]:(((in @ X25 @ (setunion @ X24))=>![X26:$o]:((![X27:$i]:(((in @ X25 @ X27)=>((in @ X27 @ X24)=>(X26))))=>(X26)))))=>(![X28:$i, X29:$i]:(((in @ X28 @ (setadjoin @ X29 @ emptyset))=>((X28)=(X29))))=>![X2:$i, X5:$i, X1:$i, X4:$o]:(((in @ X1 @ (setunion @ (setadjoin @ X2 @ (setadjoin @ X5 @ emptyset))))=>(((in @ X1 @ X2)=>(X4))=>(((in @ X1 @ X5)=>(X4))=>(X4))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[binunionEcases]), setadjoinE]), c_0_5]), uniqinunit]), setunionE])])). 0.20/0.51 thf(c_0_7, negated_conjecture, ![X30:$i, X31:$i, X32:$i, X33:$o, X34:$i, X35:$i, X36:$o, X38:$i, X39:$i]:((((((in @ X32 @ X31)|(X33)|((X32)=(X30))|~(in @ X32 @ (setadjoin @ X30 @ X31)))&(~(X33)|(X33)|((X32)=(X30))|~(in @ X32 @ (setadjoin @ X30 @ X31))))&(((in @ X32 @ X31)|(X33)|~(X33)|~(in @ X32 @ (setadjoin @ X30 @ X31)))&(~(X33)|(X33)|~(X33)|~(in @ X32 @ (setadjoin @ X30 @ X31)))))&((((in @ X35 @ (esk1_3 @ X34 @ X35 @ X36))|(X36)|~(in @ X35 @ (setunion @ X34)))&(((in @ (esk1_3 @ X34 @ X35 @ X36) @ X34)|(X36)|~(in @ X35 @ (setunion @ X34)))&(~(X36)|(X36)|~(in @ X35 @ (setunion @ X34)))))&((~(in @ X38 @ (setadjoin @ X39 @ emptyset))|((X38)=(X39)))&((in @ esk4_0 @ (setunion @ (setadjoin @ esk2_0 @ (setadjoin @ esk3_0 @ emptyset))))&((~(in @ esk4_0 @ esk2_0)|(epred1_0))&((~(in @ esk4_0 @ esk3_0)|(epred1_0))&~(epred1_0)))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])])). 0.20/0.51 thf(c_0_8, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((in @ X1 @ X2)|((X1)=(X3))|~((in @ X1 @ (setadjoin @ X3 @ X2))))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7])])])). 0.20/0.51 thf(c_0_9, negated_conjecture, ![X2:$i, X1:$i]:(((in @ (esk1_3 @ X1 @ X2 @ (~($true))) @ X1)|~((in @ X2 @ (setunion @ X1))))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7])])])). 0.20/0.51 thf(c_0_10, negated_conjecture, ![X1:$i, X2:$i]:((((X1)=(X2))|~((in @ X1 @ (setadjoin @ X2 @ emptyset))))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.51 thf(c_0_11, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:((((esk1_3 @ (setadjoin @ X1 @ X2) @ X3 @ (~($true)))=(X1))|(in @ (esk1_3 @ (setadjoin @ X1 @ X2) @ X3 @ (~($true))) @ X2)|~((in @ X3 @ (setunion @ (setadjoin @ X1 @ X2)))))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 0.20/0.51 thf(c_0_12, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:((((esk1_3 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ X3 @ (~($true)))=(X1))|((esk1_3 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ X3 @ (~($true)))=(X2))|~((in @ X3 @ (setunion @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.20/0.51 thf(c_0_13, negated_conjecture, (in @ esk4_0 @ (setunion @ (setadjoin @ esk2_0 @ (setadjoin @ esk3_0 @ emptyset)))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.51 thf(c_0_14, negated_conjecture, ((epred1_0)|~((in @ esk4_0 @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.51 thf(c_0_15, negated_conjecture, ~((epred1_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.51 thf(c_0_16, negated_conjecture, ![X1:$i, X2:$i]:(((in @ X1 @ (esk1_3 @ X2 @ X1 @ (~($true))))|~((in @ X1 @ (setunion @ X2))))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7])])])). 0.20/0.51 thf(c_0_17, negated_conjecture, (((esk1_3 @ (setadjoin @ esk2_0 @ (setadjoin @ esk3_0 @ emptyset)) @ esk4_0 @ (~($true)))=(esk3_0))|((esk1_3 @ (setadjoin @ esk2_0 @ (setadjoin @ esk3_0 @ emptyset)) @ esk4_0 @ (~($true)))=(esk2_0))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.20/0.51 thf(c_0_18, negated_conjecture, ~((in @ esk4_0 @ esk3_0)), inference(sr,[status(thm)],[c_0_14, c_0_15])). 0.20/0.51 thf(c_0_19, negated_conjecture, ((epred1_0)|~((in @ esk4_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.51 thf(c_0_20, negated_conjecture, ((esk1_3 @ (setadjoin @ esk2_0 @ (setadjoin @ esk3_0 @ emptyset)) @ esk4_0 @ (~($true)))=(esk2_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_13])]), c_0_18])). 0.20/0.51 thf(c_0_21, negated_conjecture, ~((in @ esk4_0 @ esk2_0)), inference(sr,[status(thm)],[c_0_19, c_0_15])). 0.20/0.51 thf(c_0_22, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_20]), c_0_13])]), c_0_21]), ['proof']). 0.20/0.51 # SZS output end CNFRefutation 0.20/0.51 # Parsed axioms : 13 0.20/0.51 # Removed by relevancy pruning/SinE : 8 0.20/0.51 # Initial clauses : 12 0.20/0.51 # Removed in clause preprocessing : 4 0.20/0.51 # Initial clauses in saturation : 8 0.20/0.51 # Processed clauses : 25 0.20/0.51 # ...of these trivial : 0 0.20/0.51 # ...subsumed : 0 0.20/0.51 # ...remaining for further processing : 25 0.20/0.51 # Other redundant clauses eliminated : 0 0.20/0.51 # Clauses deleted for lack of memory : 0 0.20/0.51 # Backward-subsumed : 0 0.20/0.51 # Backward-rewritten : 1 0.20/0.51 # Generated clauses : 23 0.20/0.51 # ...of the previous two non-redundant : 22 0.20/0.51 # ...aggressively subsumed : 0 0.20/0.51 # Contextual simplify-reflections : 0 0.20/0.51 # Paramodulations : 22 0.20/0.51 # Factorizations : 1 0.20/0.51 # NegExts : 0 0.20/0.51 # Equation resolutions : 0 0.20/0.51 # Disequality decompositions : 0 0.20/0.51 # Total rewrite steps : 6 0.20/0.51 # ...of those cached : 4 0.20/0.51 # Propositional unsat checks : 0 0.20/0.51 # Propositional check models : 0 0.20/0.51 # Propositional check unsatisfiable : 0 0.20/0.51 # Propositional clauses : 0 0.20/0.51 # Propositional clauses after purity: 0 0.20/0.51 # Propositional unsat core size : 0 0.20/0.51 # Propositional preprocessing time : 0.000 0.20/0.51 # Propositional encoding time : 0.000 0.20/0.51 # Propositional solver time : 0.000 0.20/0.51 # Success case prop preproc time : 0.000 0.20/0.51 # Success case prop encoding time : 0.000 0.20/0.51 # Success case prop solver time : 0.000 0.20/0.51 # Current number of processed clauses : 16 0.20/0.51 # Positive orientable unit clauses : 2 0.20/0.51 # Positive unorientable unit clauses: 0 0.20/0.51 # Negative unit clauses : 3 0.20/0.51 # Non-unit-clauses : 11 0.20/0.51 # Current number of unprocessed clauses: 12 0.20/0.51 # ...number of literals in the above : 34 0.20/0.51 # Current number of archived formulas : 0 0.20/0.51 # Current number of archived clauses : 9 0.20/0.51 # Clause-clause subsumption calls (NU) : 37 0.20/0.51 # Rec. Clause-clause subsumption calls : 37 0.20/0.51 # Non-unit clause-clause subsumptions : 0 0.20/0.51 # Unit Clause-clause subsumption calls : 3 0.20/0.51 # Rewrite failures with RHS unbound : 0 0.20/0.51 # BW rewrite match attempts : 1 0.20/0.51 # BW rewrite match successes : 1 0.20/0.51 # Condensation attempts : 25 0.20/0.51 # Condensation successes : 0 0.20/0.51 # Termbank termtop insertions : 1810 0.20/0.51 # Search garbage collected termcells : 461 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.004 s 0.20/0.51 # System time : 0.001 s 0.20/0.51 # Total time : 0.005 s 0.20/0.51 # Maximum resident set size: 1924 pages 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.004 s 0.20/0.51 # System time : 0.003 s 0.20/0.51 # Total time : 0.007 s 0.20/0.51 # Maximum resident set size: 1712 pages 0.20/0.51 % E---3.1 exiting 0.20/0.51 % E exiting 0.20/0.51 EOF